Constructions of Fast-Decodable Distributed Space-Time Codes
نویسندگان
چکیده
Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.
منابع مشابه
Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel
In this article, the first general constructions of fast-decodable, more specifically (conditionally) ggroup decodable, space–time block codes for the Nonorthogonal Amplify and Forward (NAF) MultipleInput Multiple-Output (MIMO) relay channel under the half-duplex constraint are proposed. In this scenario, the source and the intermediate relays used for data amplification are allowed to employ m...
متن کاملOn Fast-Decodable Algebraic Space-Time Codes
In the near future, the 5th generation (5G) wireless systems will be established. They will consist of an integration of different techniques, including distributed antenna systems and massive multiple-input multiple-output systems, and the overall performance will highly depend on the channel coding techniques employed. Due to the nature of future wireless networks, space– time codes are no lo...
متن کاملGeneralized Distributive Law for ML Decoding of Space-Time Block Codes
The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known tech...
متن کاملThe nonassociative algebras used to build fast-decodable space-time block codes
Let K/F and K/L be two cyclic Galois field extensions and D = (K/F, σ, c) a cyclic algebra. Given an invertible element d ∈ D, we present three families of unital nonassociative algebras over L ∩ F defined on the direct sum of n copies of D. Two of these families appear either explicitly or implicitly in the designs of fast-decodable space-time block codes in papers by Srinath, Rajan, Markin, O...
متن کاملN ° d’ordre: 2011-20-TH THÈSE DE DOCTORAT SPECIALITE: PHYSIQUE Ecole Doctorale « Sciences et Technologies de l’Information des
The last few years witnessed a dramatic increase in the demand on high-rate reliable wireless communications due to the incorporation of broadband internet access and demanding multimedia services such as high-definition audio and video streaming to modern wireless devices. In order to meet these new requirements, resorting to Multiple-Input Multiple-Output (MIMO) techniques was inevitable as t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014